منابع مشابه
Weakness of F36·509 for Discrete Logarithm Cryptography
In 2013, Joux, and then Barbulescu, Gaudry, Joux and Thomé, presented new algorithms for computing discrete logarithms in finite fields of small and medium characteristic. We show that these new algorithms render the finite field F36·509 = F33054 weak for discrete logarithm cryptography in the sense that discrete logarithms in this field can be computed significantly faster than with the previo...
متن کاملMonoclonal Antibodies (F36/22 and M7/105) to Human Breast Carcinoma1
Cloned hybridoma cell lines were obtained from fusions of murine myeloma cells with lymphocytes of mice immunized against human breast cancer cells. Hybridomas F36/22 and M7/ 105 produced antibodies whose binding to breast cancer cells could not be inhibited by prior absorptions with fibroblasts, lymphoblastoid cells, or erythrocytes. Results from cell surface binding assays using a panel of tu...
متن کاملExpression of ductal carcinoma antigen in breast cancer sera as defined using monoclonal antibody F36/22.
A quantitative immunoassay procedure has been constructed to evaluate levels of ductal carcinoma antigen recognized by murine McAb F36/22. Using this method, 3% of 64 apparently healthy individuals and 13% of 40 patients with benign breast disease expressed serum antigen levels above 70 units/ml. Greater than 50% of 116 patients with clinical evidence of breast cancer demonstrated circulating d...
متن کاملMonoclonal antibodies (F36/22 and M7/105) to human breast carcinoma.
Cloned hybridoma cell lines were obtained from fusions of murine myeloma cells with lymphocytes of mice immunized against human breast cancer cells. Hybridomas F36/22 and M7/105 produced antibodies whose binding to breast cancer cells could not be inhibited by prior absorptions with fibroblasts, lymphoblastoid cells, or erythrocytes. Results from cell surface binding assays using a panel of tum...
متن کاملComputing Discrete Logarithms in 𝔽36...137 and 𝔽36...163 Using Magma
We show that a Magma implementation of Joux’s new L[1/4] algorithm can be used to compute discrete logarithms in the 1303-bit finite field F36·137 and the 1551-bit finite field F36·163 with very modest computational resources. Our F36·137 implementation was the first to illustrate the effectiveness of Joux’s algorithm for computing discrete logarithms in small-characteristic finite fields that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Arthropod Management Tests
سال: 2012
ISSN: 2155-9856
DOI: 10.4182/amt.2012.f36